On the maximum number of edges in a hypergraph with a unique perfect matching

On the maximum number of edges in a hypergraph with a unique perfect matching

In this note, we determine the maximum number of edges of a k-uniform hypergraph, k ≥ 3, with a unique perfect matching. This settles a conjecture proposed by Snevily.

On the maximum number of edges in a hypergraph with given matching number

The aim of the present paper is to prove that the maximum number of edges in a 3-uniform hypergraph on n vertices and matching number s is max {(3s+ 2 3 ) , ( n 3 ) − ( n− s 3 )} for all n, s, n ≥ 3s+ 2.

The Maximum Number of Edges in a Strongly Multiplicative Graph

the maximum number of edges in a strongly multiplicative graph

0

reflections on taught courses of the iranian ma program in english translation: a mixed-methods study

the issue of curriculum and syllabus evaluation and revision has been in center of attention right from when curriculum came into attention of educational institutions. thus everywhere in the world in educational institutions curricula and syllabi are evaluated and revised based on the goals, the needs, existing content, etc.. in iran any curriculum is designed in a committee of specialists and...